Approximation Spaces Based on Similarity and Dissimilarity
نویسنده
چکیده
In this article, an extension of similarity-based approximation spaces by a relation of dissimilarity of objects is proposed. Apart from the usual approximation mappings, adapted to our case, mappings of exterior, possibly negative region, and ignorance region are introduced and investigated.
منابع مشابه
Composite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملAre Case-Based Reasoning and Dissimilarity-Based Classification Two Sides of the Same Coin?
Case-Based Reasoning is used when generalized knowledge is lacking. The method works on a set of cases formerly processed and stored in the case base. A new case is interpreted based on its similarity to cases in the case base. The closest case with its associated result is selected and presented as output of the system. Recently, Dissimilarity-based Classification has been introduced due to th...
متن کاملA comprehensive experimental comparison of the aggregation techniques for face recognition
In face recognition, one of the most important problems to tackle is a large amount of data and the redundancy of information contained in facial images. There are numerous approaches attempting to reduce this redundancy. One of them is information aggregation based on the results of classifiers built on selected facial areas being the most salient regions from the point of view of classificati...
متن کاملDiversified Top-k Similarity Search in Large Attributed Networks
Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graphbased applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed...
متن کاملPhylogenetic Tree Building Using a Novel Compression-based Non-symmetric Dissimilarity Measure
An approach of building phylogenetic trees is to define a distance function based on amino acid sequences of distinct proteins. The aim of this approach is to determine a weighted tree topology that approximates the entire functional similarity relations between proteins, defined by a distance function. In this case – according to the definition the similarity relation has a symmetric property....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006